Extremal $$K_4$$-minor-free graphs without short cycles
نویسندگان
چکیده
Abstract We determine the maximum number of edges in a $$K_4$$ K 4 -minor-free n -vertex graph girth g , when $$g=5$$ g = 5 or is even. argue that there are many different extremal graphs if even and odd.
منابع مشابه
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C4-free graph on q 2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Let n be a positive integer and G a graph. We define ex(n,G) to be the largest number of edges possible in a graph on n vertices that does not contain G as a subgraph; we call a graph o...
متن کاملExtremal graphs without three-cycles or four-cycles
We derive bounds for f(v), the maximum number of edges in a graph on v vertices that contains neither three-cycles nor four-cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200.
متن کاملDirected Graphs Without Short Cycles
For a directed graph G without loops or parallel edges, let β(G) denote the size of the smallest feedback arc set, i.e., the smallest subset X ⊂ E(G) such that G \X has no directed cycles. Let γ(G) be the number of unordered pairs of vertices of G which are not adjacent. We prove that every directed graph whose shortest directed cycle has length at least r ≥ 4 satisfies β(G) ≤ cγ(G)/r, where c ...
متن کاملOn the girth of extremal graphs without shortest cycles
Let EX (ν; {C3, . . . ,Cn}) denote the set of graphs G of order ν that contain no cycles of length less than or equal to n which have maximum number of edges. In this paper we consider a problem posed by several authors: does G contain an n + 1 cycle? We prove that the diameter of G is at most n − 1, and present several results concerning the above question: the girth of G is g = n + 1 if (i) ν...
متن کاملChoosability of toroidal graphs without short cycles
Let G be a toroidal graph without cycles of a fixed length k, and l (G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant number: CUHK4165/01E (to L. C.); Contract grant sponsor: NSFC; Contract grant number: 10771197 (to W. W.); Contract grant sponsor: ZJNSFC; Contract grant number: Z6090150 (to W. W.); Contract grant sponsor: NSC97-2115...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Mathematica Hungarica
سال: 2022
ISSN: ['0031-5303', '1588-2829']
DOI: https://doi.org/10.1007/s10998-022-00465-7